Problems on Self-similar Sets and Self-affine Sets: an Update
نویسنده
چکیده
منابع مشابه
A Characterization of Hyperbolic Affine Iterated Function Systems
The two main theorems of this paper provide a characterization of hyperbolic affine iterated function systems defined on R. Atsushi Kameyama [Distances on topological self-similar sets, in Fractal Geometry and Applications: A Jubilee of Benǒit Mandelbrot. Proceedings of Symposia in Pure Mathematics, Volume 72, Part 1, 2004, pages 117–129] asked the following fundamental question: Given a topolo...
متن کاملSelf-similar and self-affine sets; measure of the intersection of two copies
Let K ⊂ R be a self-similar or self-affine set, let μ be a self-similar or self-affine measure on it, and let G be the group of affine maps, similitudes, isometries or translations of R. Under various assumptions (such as separation conditions or we assume that the transformations are small perturbations or that K is a so called Sierpiński sponge) we prove theorems of the following types, which...
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کاملPSEUDO-SELF-AFFINE TILINGS IN Rd
It is proved that every pseudo-self-affine tiling in R is mutually locally derivable with a self-affine tiling. A characterization of pseudo-self-similar tilings in terms of derived Voronöı tessellations is a corollary. Previously, these results were obtained in the planar case, jointly with Priebe Frank. The new approach is based on the theory of graph-directed iterated function systems and su...
متن کاملUndecidable Properties of Self-affine Sets and Multi-tape Automata
We study the decidability of some properties of self-affine sets specified by a graph-directed iterated function system (GIFS) with rational coefficients. We focus on topological properties and we prove that having empty interior is undecidable in dimension two. These results are obtained by studying a particular class of self-affine sets associated with multitape automata. We first establish t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999